Triangles in C5?free graphs and hypergraphs of girth six
نویسندگان
چکیده
We introduce a new approach and prove that the maximum number of triangles in C 5 -free graph on n vertices is at most ( 1 + o ) 3 2 ? . show connection to r-uniform hypergraphs without (Berge) cycles length less than six, estimate their possible size. Using our approach, we also (slightly) improve previous size an induced- 4 graph.
منابع مشابه
On Tensor Product of Graphs, Girth and Triangles
The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.
متن کاملGeneralized Girth Problems in Graphs and Hypergraphs
We study the asymptotic value of several extremal problems on graphs and hypergraphs, that arise as generalized notions of girth. Apart from being combinatorially natural questions, they are motivated by computational-theoretic applications. 1. An `-subgraph is a subgraph with ` edges per vertex, or equivalently, average degree 2`. What is the optimal upper bound S`(n, d), such that any graph o...
متن کاملFinding Triangles and Computing the Girth in Disk Graphs∗
Let S ⊂ R be a set of n point sites, where each s ∈ S has an associated radius rs > 0. The disk graph D(S) of S is the graph with vertex set S and an edge between two sites s and t if and only if |st| ≤ rs + rt, i.e., if the disks with centers s and t and radii rs and rt, respectively, intersect. Disk graphs are useful to model sensor networks. We study the problems of finding triangles and of ...
متن کاملOn Tensor Product of Graphs, Girth and Triangles
The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph G⊕K2 to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.
متن کاملRamsey-type numbers involving graphs and hypergraphs with large girth
For a set of integers S, define ( S APk ) to be the k-uniform hypergraph with vertex set S and hyperedges corresponding to the set of all arithmetic progression of length k in S. Similarly, for a graph H, define ( H Kk ) to be the ( k 2 ) -uniform hypergraph on the vertex set E(H) with hyperedges corresponding to the edge sets of all copies of Kk in H. Also, we say that a k-uniform hypergraph h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2021
ISSN: ['0364-9024', '1097-0118']
DOI: https://doi.org/10.1002/jgt.22723